Task Assignment by Self-Organizing Maps

نویسندگان

  • Hans-Ulrich Heiss
  • Marcus Dormanns
چکیده

To execute a parallel program on a multicomputer system, the tasks of the program have to be mapped to the particular processors of the parallel machine. To keep communication delays low, communicating tasks should be placed closely together. Since both the communication structure of the program and the interconnection structure of the parallel machine can be represented as graphs, the mapping problem can be regarded as a graph embedding problem to minimize communication costs. As a heuristic approach to this NP-hard problem we apply Kohonen's self-organizing maps to establish a topology-preserving embedding. Besides injective (one-toone) mappigs we mainly consider contractive (many-to-one) assignments, where in addition the load balancing problem has to be solved. Results from simulation experiments are presented and compared to other approaches to this problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Landforms identification using neural network-self organizing map and SRTM data

During an 11 days mission in February 2000 the Shuttle Radar Topography Mission (SRTM) collected data over 80% of the Earth's land surface, for all areas between 60 degrees N and 56 degrees S latitude. Since SRTM data became available, many studies utilized them for application in topography and morphometric landscape analysis. Exploiting SRTM data for recognition and extraction of topographic ...

متن کامل

LabelSOM: on the labeling of self-organizing maps

| Self-organizing maps are a prominent unsuper-vised neural network model providing cluster analysis of high-dimensional input data. However, in spite of enhanced vi-sualization techniques for self-organizing maps, interpreting a trained map proves to be diicult because the features responsible for a speciic cluster assignment are not evident from the resulting map representation. In this paper...

متن کامل

Self-Organizing Feature Maps with Self-Organizing Neighborhood Widths

Self-organizing feature maps with self-determined local neighborhood widths are applied to construct principal manifolds of data distributions. This task exempli es the problem of the learning of learning parameters in neural networks. The proposed algorithm is based upon analytical results on phase transitions in self-organizing feature maps available for idealized situations. By illustrative ...

متن کامل

Automated Knowledge Acquisition Based on Unsupervised Neural Network and Expert System Paradigms

-Self-organizing maps are an unsupervised neural network model that lends itself to the cluster analysis of high dimensional input data. However, interpreting a trained map proves to be difficult because the features responsible for specific cluster assignment are not evident from resulting map representation. Paper presents an approach for automated knowledge acquisition system using Kohonen s...

متن کامل

Dialogue Act Recognition in Estonian Dialogues Using Artificial Neural Networks

This paper describes two experiments of applying dialogue act recognition to estonian dialogues. Two class systems were used in both of them—a general one (with 19 classes) and a detailed one (with 107 classes). In the first experiment the task was performed using learning vector quantization (LVQ). The preprocessing was done in WEBSOM (Self-Organizing Maps for Internet Exploration) style; the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001